The expressibility of fragments of Hybrid Graph Logic on finite digraphs

نویسندگان

  • James Gate
  • Iain A. Stewart
چکیده

Hybrid Graph Logic is a logic designed for reasoning about graphs and is built from a basic modal logic, augmented with the use of nominals and a facility to verify the existence of paths in graphs. We study the finite model theory of Hybrid Graph Logic. In particular, we develop pebble games for Hybrid Graph Logic and use these games to exhibit strict infinite hierarchies involving fragments of Hybrid Graph Logic when the logic is used to define problems involving finite digraphs. These fragments are parameterized by the quantifier-rank of formulae along with the numbers of propositional symbols and nominals that are available. We ascertain exactly the relative definability of these parameterized fragments of the logic.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Expression of Graph Properties in some Fragments of Monadic Second-Order Logic

We review the expressibility of some basic graph properties in certain fragments of Monadic Second-Order logic, like the set of Monadic-NP formulas. We focus on cases where a property and its negation are both expressible in the same (or in closely related) fragments. We examine cases where edge quantifications can be eliminated and cases where they cannot. We compare two logical expressions of...

متن کامل

Twin signed total Roman domatic numbers in digraphs

Let $D$ be a finite simple digraph with vertex set $V(D)$ and arcset $A(D)$. A twin signed total Roman dominating function (TSTRDF) on thedigraph $D$ is a function $f:V(D)rightarrow{-1,1,2}$ satisfyingthe conditions that (i) $sum_{xin N^-(v)}f(x)ge 1$ and$sum_{xin N^+(v)}f(x)ge 1$ for each $vin V(D)$, where $N^-(v)$(resp. $N^+(v)$) consists of all in-neighbors (resp.out-neighbors) of $v$, and (...

متن کامل

More skew-equienergetic digraphs

Two digraphs of same order are said to be skew-equienergetic if their skew energies are equal. One of the open problems proposed by Li and Lian was to construct non-cospectral skew-equienergetic digraphs on n vertices. Recently this problem was solved by Ramane et al. In this  paper, we give some new methods to construct new skew-equienergetic digraphs.

متن کامل

A Survey on Small Fragments of First-Order Logic over Finite Words

We consider fragments of first-order logic over finite words. In particular, we deal with first-order logic with a restricted number of variables and with the lower levels of the alternation hierarchy. We use the algebraic approach to show decidability of expressibility within these fragments. As a byproduct, we survey several characterizations of the respective fragments. We give complete proo...

متن کامل

Approximate formulae for a logic that capture classes of computational complexity

This paper presents a syntax of approximate formulae suited for the logic with counting quantifiers SOLP. This logic was formalised by us in [1] where, among other properties, we showed the following facts: (i) In the presence of a built–in (linear) order, SOLP can describe NP–complete problems and some of its fragments capture the classes P and NL; (ii) weakening the ordering relation to an al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Applied Logic

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2013